Aggregated 2D range queries on clustered points
نویسندگان
چکیده
منابع مشابه
Aggregated 2D Range Queries on Clustered Points
Efficient processing of aggregated range queries on two-dimensional grids is a common requirement in information retrieval and data mining systems, for example in Geographic Information Systems and OLAP cubes. We introduce a technique to represent grids supporting aggregated range queries that requires little space when the data points in the grid are clustered, which is common in practice. We ...
متن کاملEncoding 2D Range Maximum Queries
We consider the two-dimensional range maximum query (2DRMQ) problem: given an array A of ordered values, to pre-process it so that we can find the position of the largest element in a (user-specified) range of rows and range of columns. We focus on determining the effective entropy of 2D-RMQ, i.e., how many bits are needed to encode A so that 2D-RMQ queries can be answered without access to A. ...
متن کاملFast Range Queries Using Pre - Aggregated in - Network Storage
To my Mother and Father. iii Acknowledgements First of all, I would like to express my gratitude towards Prof. Gul Agha, for his support and encouragement, throughout my stay here and treating me like a friend and peer. I also thank him for the freedom he gave me in pursuing problems on my own, while giving critical advise to prevent me from straying too much off course. The work in this thesis...
متن کاملOn Finding Skyline Points for Range Queries in Plane
We consider the dominating point set reporting problem in two-dimension. We propose a data structure for finding the set of dominating points inside a given orthogonal query rectangle. Given a set of n points in the plane, it supports 4-sided queries in O(log n+k), where k is size of the output, using O(n log n) space. This work can be of application when range queries are generated using mobil...
متن کاملRange Queries on Uncertain Data
Given a set P of n uncertain points on the real line, each represented by its one-dimensional probability density function, we consider the problem of building data structures on P to answer range queries of the following three types for any query interval I : (1) top-1 query: find the point in P that lies in I with the highest probability, (2) top-k query: given any integer k ≤ n as part of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Systems
سال: 2016
ISSN: 0306-4379
DOI: 10.1016/j.is.2016.03.004